The Degree to Which Faculty Members in Jordanian Universities Practice Social Responsibility, the Problems They Face, and the Solutions Proposed from Their Point of View

The study aimed to identify the degree to which faculty members in Jordanian universities practice social responsibility, the problems facing them and the proposed solutions from their point of view, and the study adopted the descriptive survey approach, and the researchers developed a questionnaire consisting of three journals, and to achieve the objectives of the study, direct interviews were conducted with faculty members in Jordanian universities to identify the problems that prevent them from exercising social responsibility, and to identify and proposed solutions to those problems, where the study community consists of all faculty members in a number of public and private universities in the northern region in the governorate of Irbid, whose number is (3089) faculty members. The study sample is of (423) faculty members, who were chosen in the random way available, and the results of the study showed that the degree of practicing social responsibility among faculty members in Jordanian universities from the viewpoint of the faculty members came with a (medium) grade. The results revealed that there were no statistically significant differences attributed to the variables (gender, college, academic rank, and university type), and the presence of statistically significant differences attributed to the variable (academic rank), as they came in favor of (assistant professor), and the researchers recommend that the faculty members should include responsibility. Community-based plans and courses for students. Societal

Examining the Personality of Arthur Fleck in Joker 2019: The Shift From an Innocent Man Into a Supervillain

Todd Phillips’ film Joker, a 2019 psychological thriller, has displayed the main character, Arthur Fleck, as a perplexing, eccentric character. Arthur appears to be a poor, marginalized man at first glance. But as the plot progresses and we witness life from Arthur’s perspective, we’re left questioning whether he’s a good man, a bad man, or just schizophrenic. In this research, Arthur’s perplexing personality will be examined using Sigmund Freud’s psychoanalysis. The study aims to uncover Arthur’s true personality and his shift from an innocent man into a supervillain by analyzing his Id, ego, and superego. The method used to study Arthur’s character dimensions is the descriptive qualitative method, by watching the movie and reading the script thoroughly. The study revealed that Arthur suffers from mental illnesses that affected how he was treated and that the tough circumstances Arthur has been through have shaped him into becoming the Joker.

On Spectrum Sharing Between Energy Harvesting Cognitive Radio Users and Primary Users

This paper investigates the maximum secondary throughput for a rechargeable secondary user (SU) sharing the spectrum with a primary user (PU) plugged to a reliable power supply. The SU maintains a finite energy queue and harvests energy from natural resources and primary radio frequency (RF) transmissions. We propose a power allocation policy at the PU and analyze its effect on the throughput of both the PU and SU. Furthermore, we study the impact of the bursty arrivals at the PU on the energy harvested by the SU from RF transmissions. Moreover, we investigate the impact of the rate of energy harvesting from natural resources on the SU throughput. We assume fading channels and compute exact closed-form expressions for the energy harvested by the SU under fading. Results reveal that the proposed power allocation policy along with the implemented RF energy harvesting at the SU enhance the throughput of both primary and secondary links

Power-Optimal Feedback-Based Random Spectrum Access for an Energy Harvesting Cognitive User

In this paper, we study and analyze cognitive radio networks in which secondary users (SUs) are equipped with Energy Harvesting (EH) capability. We design a random spectrum sensing and access protocol for the SU that exploits the primary link's feedback and requires less average sensing time. Unlike previous works proposed earlier in literature, we do not assume perfect feedback. Instead, we take into account the more practical possibilities of overhearing unreliable feedback signals and accommodate spectrum sensing errors. Moreover, we assume an interference-based channel model where the receivers are equipped with multi-packet reception (MPR) capability. Furthermore, we perform power allocation at the SU with the objective of maximizing the secondary throughput under constraints that maintain certain quality-of-service (QoS) measures for the primary user (PU)

Optimal Spectrum Access for a Rechargeable Cognitive Radio User Based on Energy Buffer State

This paper investigates the maximum throughput for a rechargeable secondary user (SU) sharing the spectrum with a primary user (PU) plugged to a reliable power supply. The SU maintains a finite energy queue and harvests energy from natural resources, e.g., solar, wind and acoustic noise. We propose a probabilistic access strategy by the SU based on the number of packets at its energy queue. We investigate the effect of the energy arrival rate, the amount of energy per energy packet, and the capacity of the energy queue on the SU throughput under fading channels. Results reveal that the proposed access strategy can enhance the performance of the SU.Comment: arXiv admin note: text overlap with arXiv:1407.726

Cooperative Access in Cognitive Radio Networks: Stable Throughput and Delay Tradeoffs

In this paper, we study and analyze fundamental throughput-delay tradeoffs in cooperative multiple access for cognitive radio systems. We focus on the class of randomized cooperative policies, whereby the secondary user (SU) serves either the queue of its own data or the queue of the primary user (PU) relayed data with certain service probabilities. The proposed policy opens room for trading the PU delay for enhanced SU delay. Towards this objective, stability conditions for the queues involved in the system are derived. Furthermore, a moment generating function approach is employed to derive closed-form expressions for the average delay encountered by the packets of both users. Results reveal that cooperation expands the stable throughput region of the system and significantly reduces the delay at both users. Moreover, we quantify the gain obtained in terms of the SU delay under the proposed policy, over conventional relaying that gives strict priority to the relay queue.Comment: accepted for publication in IEEE 12th Intl. Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt), 201

Energy-aware cooperative wireless networks with multiple cognitive users

In this paper, we study and analyze cooperative cognitive radio networks with arbitrary number of secondary users (SUs). Each SU is considered a prospective relay for the primary user (PU) besides having its own data transmission demand. We consider a multi-packet transmission framework that allows multiple SUs to transmit simultaneously because of dirty-paper coding. We propose power allocation and scheduling policies that optimize the throughput for both PU and SU with minimum energy expenditure. The performance of the system is evaluated in terms of throughput and delay under different opportunistic relay selection policies. Toward this objective, we present a mathematical framework for deriving stability conditions for all queues in the system. Consequently, the throughput of both primary and secondary links is quantified. Furthermore, a moment generating function approach is employed to derive a closed-form expression for the average delay encountered by the PU packets. Results reveal that we achieve better performance in terms of throughput and delay at lower energy cost as compared with equal power allocation schemes proposed earlier in the literature. Extensive simulations are conducted to validate our theoretical findings

Improved Multi Threshold Birch Clustering Algorithm

BIRCH algorithm is a clustering algorithm suitable for very large data sets. In the algorithm, a CF-tree is built whose all entries in each leaf node must satisfy a uniform threshold T, and the CF-tree is rebuilt at each stage by different threshold. But using a single threshold cause many shortcomings in the birch algorithm, in this paper to propose a solution to this shortcoming by using multiple thresholds instead of a single threshold